0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.11 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.11/0.32 % Computer : n003.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 1920 0.11/0.32 % WCLimit : 240 0.11/0.32 % DateTime : Wed Jul 30 02:32:34 EDT 2025 0.11/0.32 % CPUTime : 0.19/0.46 Running higher-order theorem proving 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.VI5fithcFZ/E---3.1_25617.p 0.19/0.48 # Version: 3.0.0-ho 0.19/0.48 # Preprocessing class: HSMSSMSSSSSNFFN. 0.19/0.48 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.19/0.48 # Starting new_ho_10 with 1200s (5) cores 0.19/0.48 # Starting new_bool_1 with 240s (1) cores 0.19/0.48 # Starting full_lambda_5 with 240s (1) cores 0.19/0.48 # Starting new_ho_10_unif with 240s (1) cores 0.19/0.48 # new_bool_1 with pid 25696 completed with status 0 0.19/0.48 # Result found by new_bool_1 0.19/0.48 # Preprocessing class: HSMSSMSSSSSNFFN. 0.19/0.48 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.19/0.48 # Starting new_ho_10 with 1200s (5) cores 0.19/0.48 # Starting new_bool_1 with 240s (1) cores 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.19/0.48 # Search class: HGUNF-FFSF22-SFFFFFNN 0.19/0.48 # Scheduled 5 strats onto 1 cores with 240 seconds (240 total) 0.19/0.48 # Starting new_ho_10 with 145s (1) cores 0.19/0.48 # new_ho_10 with pid 25700 completed with status 0 0.19/0.48 # Result found by new_ho_10 0.19/0.48 # Preprocessing class: HSMSSMSSSSSNFFN. 0.19/0.48 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.19/0.48 # Starting new_ho_10 with 1200s (5) cores 0.19/0.48 # Starting new_bool_1 with 240s (1) cores 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.19/0.48 # Search class: HGUNF-FFSF22-SFFFFFNN 0.19/0.48 # Scheduled 5 strats onto 1 cores with 240 seconds (240 total) 0.19/0.48 # Starting new_ho_10 with 145s (1) cores 0.19/0.48 # Preprocessing time : 0.001 s 0.19/0.48 # Presaturation interreduction done 0.19/0.48 0.19/0.48 # Proof found! 0.19/0.48 # SZS status Theorem 0.19/0.48 # SZS output start CNFRefutation 0.19/0.48 thf(decl_sort1, type, frac: $tType). 0.19/0.48 thf(decl_23, type, x: frac). 0.19/0.48 thf(decl_24, type, y: frac). 0.19/0.48 thf(decl_25, type, z: frac). 0.19/0.48 thf(decl_26, type, u: frac). 0.19/0.48 thf(decl_27, type, moref: frac > frac > $o). 0.19/0.48 thf(decl_28, type, eq: frac > frac > $o). 0.19/0.48 thf(decl_29, type, pf: frac > frac > frac). 0.19/0.48 thf(satz44, axiom, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((((eq @ X2 @ X4)=>(moref @ X3 @ X4))<=(eq @ X1 @ X3))<=(moref @ X1 @ X2))), file('/export/starexec/sandbox2/tmp/tmp.VI5fithcFZ/E---3.1_25617.p', satz44)). 0.19/0.48 thf(satz56, axiom, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((eq @ X1 @ X2)=>((eq @ X3 @ X4)=>(eq @ (pf @ X1 @ X3) @ (pf @ X2 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.VI5fithcFZ/E---3.1_25617.p', satz56)). 0.19/0.48 thf(satz61, axiom, ![X1:frac, X2:frac, X3:frac]:(((moref @ X1 @ X2)=>(moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X3)))), file('/export/starexec/sandbox2/tmp/tmp.VI5fithcFZ/E---3.1_25617.p', satz61)). 0.19/0.48 thf(satz65b, conjecture, (moref @ (pf @ x @ z) @ (pf @ y @ u)), file('/export/starexec/sandbox2/tmp/tmp.VI5fithcFZ/E---3.1_25617.p', satz65b)). 0.19/0.48 thf(satz64, axiom, ![X1:frac, X2:frac, X3:frac, X4:frac]:((((moref @ X3 @ X4)=>(moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X4)))<=(moref @ X1 @ X2))), file('/export/starexec/sandbox2/tmp/tmp.VI5fithcFZ/E---3.1_25617.p', satz64)). 0.19/0.48 thf(satz37, axiom, ![X1:frac]:((eq @ X1 @ X1)), file('/export/starexec/sandbox2/tmp/tmp.VI5fithcFZ/E---3.1_25617.p', satz37)). 0.19/0.48 thf(n, axiom, ((eq @ z @ u)<=~((moref @ z @ u))), file('/export/starexec/sandbox2/tmp/tmp.VI5fithcFZ/E---3.1_25617.p', n)). 0.19/0.48 thf(m, axiom, (moref @ x @ y), file('/export/starexec/sandbox2/tmp/tmp.VI5fithcFZ/E---3.1_25617.p', m)). 0.19/0.48 thf(c_0_8, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((moref @ X1 @ X2)=>((eq @ X1 @ X3)=>((eq @ X2 @ X4)=>(moref @ X3 @ X4))))), inference(fof_simplification,[status(thm)],[satz44])). 0.19/0.48 thf(c_0_9, plain, ![X22:frac, X23:frac, X24:frac, X25:frac]:((~(moref @ X22 @ X23)|(~(eq @ X22 @ X24)|(~(eq @ X23 @ X25)|(moref @ X24 @ X25))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])). 0.19/0.48 thf(c_0_10, plain, ![X33:frac, X34:frac, X35:frac, X36:frac]:((~(eq @ X33 @ X34)|(~(eq @ X35 @ X36)|(eq @ (pf @ X33 @ X35) @ (pf @ X34 @ X36))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz56])])])). 0.19/0.48 thf(c_0_11, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((moref @ X3 @ X4)|~((moref @ X1 @ X2))|~((eq @ X1 @ X3))|~((eq @ X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.19/0.48 thf(c_0_12, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((eq @ (pf @ X1 @ X3) @ (pf @ X2 @ X4))|~((eq @ X1 @ X2))|~((eq @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_10])). 0.19/0.48 thf(c_0_13, plain, ![X30:frac, X31:frac, X32:frac]:((~(moref @ X30 @ X31)|(moref @ (pf @ X30 @ X32) @ (pf @ X31 @ X32)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz61])])])). 0.19/0.48 thf(c_0_14, negated_conjecture, ~(moref @ (pf @ x @ z) @ (pf @ y @ u)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz65b])])). 0.19/0.48 thf(c_0_15, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((moref @ X1 @ X2)=>((moref @ X3 @ X4)=>(moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X4))))), inference(fof_simplification,[status(thm)],[satz64])). 0.19/0.48 thf(c_0_16, plain, ![X1:frac, X4:frac, X7:frac, X6:frac, X3:frac, X2:frac]:(((moref @ X1 @ (pf @ X2 @ X3))|~((moref @ X4 @ (pf @ X6 @ X7)))|~((eq @ X4 @ X1))|~((eq @ X7 @ X3))|~((eq @ X6 @ X2)))), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.19/0.48 thf(c_0_17, plain, ![X1:frac, X3:frac, X2:frac]:(((moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X3))|~((moref @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.19/0.48 thf(c_0_18, plain, ![X37:frac]:((eq @ X37 @ X37)), inference(variable_rename,[status(thm)],[satz37])). 0.19/0.48 thf(c_0_19, plain, (~(moref @ z @ u)=>(eq @ z @ u)), inference(fof_simplification,[status(thm)],[n])). 0.19/0.48 thf(c_0_20, negated_conjecture, ~(moref @ (pf @ x @ z) @ (pf @ y @ u)), inference(fof_nnf,[status(thm)],[c_0_14])). 0.19/0.48 thf(c_0_21, plain, ![X26:frac, X27:frac, X28:frac, X29:frac]:((~(moref @ X26 @ X27)|(~(moref @ X28 @ X29)|(moref @ (pf @ X26 @ X28) @ (pf @ X27 @ X29))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])). 0.19/0.48 thf(c_0_22, plain, ![X1:frac, X3:frac, X2:frac, X4:frac, X6:frac, X7:frac]:(((moref @ X1 @ (pf @ X2 @ X3))|~((eq @ (pf @ X4 @ X6) @ X1))|~((eq @ X6 @ X3))|~((eq @ X7 @ X2))|~((moref @ X4 @ X7)))), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.19/0.48 thf(c_0_23, plain, ![X1:frac]:((eq @ X1 @ X1)), inference(split_conjunct,[status(thm)],[c_0_18])). 0.19/0.48 thf(c_0_24, plain, ((moref @ z @ u)|(eq @ z @ u)), inference(fof_nnf,[status(thm)],[c_0_19])). 0.19/0.48 thf(c_0_25, negated_conjecture, ~((moref @ (pf @ x @ z) @ (pf @ y @ u))), inference(split_conjunct,[status(thm)],[c_0_20])). 0.19/0.48 thf(c_0_26, plain, ![X1:frac, X2:frac, X3:frac, X4:frac]:(((moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X4))|~((moref @ X1 @ X2))|~((moref @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.19/0.48 thf(c_0_27, plain, (moref @ x @ y), inference(split_conjunct,[status(thm)],[m])). 0.19/0.48 thf(c_0_28, plain, ![X1:frac, X3:frac, X4:frac, X2:frac, X6:frac]:(((moref @ (pf @ X1 @ X2) @ (pf @ X3 @ X4))|~((eq @ X2 @ X4))|~((eq @ X6 @ X3))|~((moref @ X1 @ X6)))), inference(spm,[status(thm)],[c_0_22, c_0_23])). 0.19/0.48 thf(c_0_29, plain, ((moref @ z @ u)|(eq @ z @ u)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.19/0.48 thf(c_0_30, negated_conjecture, ~((moref @ z @ u)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])])). 0.19/0.48 thf(c_0_31, plain, ![X2:frac, X1:frac, X4:frac, X3:frac]:(((moref @ (pf @ X1 @ X2) @ (pf @ X3 @ X4))|~((eq @ X2 @ X4))|~((moref @ X1 @ X3)))), inference(spm,[status(thm)],[c_0_28, c_0_23])). 0.19/0.48 thf(c_0_32, plain, (eq @ z @ u), inference(sr,[status(thm)],[c_0_29, c_0_30])). 0.19/0.48 thf(c_0_33, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_31]), c_0_32]), c_0_27])]), ['proof']). 0.19/0.48 # SZS output end CNFRefutation 0.19/0.48 # Parsed axioms : 17 0.19/0.48 # Removed by relevancy pruning/SinE : 9 0.19/0.48 # Initial clauses : 8 0.19/0.48 # Removed in clause preprocessing : 0 0.19/0.48 # Initial clauses in saturation : 8 0.19/0.48 # Processed clauses : 38 0.19/0.48 # ...of these trivial : 0 0.19/0.48 # ...subsumed : 1 0.19/0.48 # ...remaining for further processing : 37 0.19/0.48 # Other redundant clauses eliminated : 0 0.19/0.48 # Clauses deleted for lack of memory : 0 0.19/0.48 # Backward-subsumed : 1 0.19/0.48 # Backward-rewritten : 0 0.19/0.48 # Generated clauses : 39 0.19/0.48 # ...of the previous two non-redundant : 37 0.19/0.48 # ...aggressively subsumed : 0 0.19/0.48 # Contextual simplify-reflections : 0 0.19/0.48 # Paramodulations : 38 0.19/0.48 # Factorizations : 0 0.19/0.48 # NegExts : 0 0.19/0.48 # Equation resolutions : 0 0.19/0.48 # Disequality decompositions : 0 0.19/0.48 # Total rewrite steps : 4 0.19/0.48 # ...of those cached : 2 0.19/0.48 # Propositional unsat checks : 0 0.19/0.48 # Propositional check models : 0 0.19/0.48 # Propositional check unsatisfiable : 0 0.19/0.48 # Propositional clauses : 0 0.19/0.48 # Propositional clauses after purity: 0 0.19/0.48 # Propositional unsat core size : 0 0.19/0.48 # Propositional preprocessing time : 0.000 0.19/0.48 # Propositional encoding time : 0.000 0.19/0.48 # Propositional solver time : 0.000 0.19/0.48 # Success case prop preproc time : 0.000 0.19/0.48 # Success case prop encoding time : 0.000 0.19/0.48 # Success case prop solver time : 0.000 0.19/0.48 # Current number of processed clauses : 27 0.19/0.48 # Positive orientable unit clauses : 3 0.19/0.48 # Positive unorientable unit clauses: 0 0.19/0.48 # Negative unit clauses : 4 0.19/0.48 # Non-unit-clauses : 20 0.19/0.48 # Current number of unprocessed clauses: 12 0.19/0.48 # ...number of literals in the above : 66 0.19/0.48 # Current number of archived formulas : 0 0.19/0.48 # Current number of archived clauses : 10 0.19/0.48 # Clause-clause subsumption calls (NU) : 179 0.19/0.48 # Rec. Clause-clause subsumption calls : 128 0.19/0.48 # Non-unit clause-clause subsumptions : 1 0.19/0.48 # Unit Clause-clause subsumption calls : 7 0.19/0.48 # Rewrite failures with RHS unbound : 0 0.19/0.48 # BW rewrite match attempts : 1 0.19/0.48 # BW rewrite match successes : 0 0.19/0.48 # Condensation attempts : 38 0.19/0.48 # Condensation successes : 0 0.19/0.48 # Termbank termtop insertions : 1799 0.19/0.48 # Search garbage collected termcells : 155 0.19/0.48 0.19/0.48 # ------------------------------------------------- 0.19/0.48 # User time : 0.008 s 0.19/0.48 # System time : 0.001 s 0.19/0.48 # Total time : 0.009 s 0.19/0.48 # Maximum resident set size: 1748 pages 0.19/0.48 0.19/0.48 # ------------------------------------------------- 0.19/0.48 # User time : 0.009 s 0.19/0.48 # System time : 0.003 s 0.19/0.48 # Total time : 0.012 s 0.19/0.48 # Maximum resident set size: 1736 pages 0.19/0.48 % E exiting 0.19/0.48 % E exiting 0.19/0.48 EOF